class Solution(object):
    def findMin(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        l = 0
        size = len(nums)
        h = size - 1
        while l < h:
            m = l + (h - l) / 2
            if nums[m] < nums[h]:
                h = m
            elif nums[m] == nums[h]:
                h = h - 1
            else:
                l = m + 1
        return nums[l]
